Efficient String Matching Using Bit Parallelism

Bit parallelism is an inherent property of computer to perform bitwise a parallel operation on computer word, but it is performed only on data available in single computer word. Bit parallelism inherently favors parallelism of bit operations within computer word. Parallel computing comprises bit parallelism and analyzed that it can be carried out “in parallel” which ensures utilizing the word size of computer. This technique is being properly utilized to work out on various string matching problems for increasing the efficiency of various real world applications. Since 1992 bit parallelism is being used in string matching applications to improve the matching pace. There are a variety of important bit parallel string matching algorithms exist like Shift-OR, BNDM, TNDM, SBNDM, BNDMq, Shift-OR with Q-Gram, and Multiple Patterns BNDM. This paper discusses the various important bit parallel string matching algorithms by means of example along with their advantages and disadvantages.